n, m = map(int, input(). split())
a = list(map(str, input(). split()))
b = list(map(str, input(). split()))
s = int(input())
while s:
c = int(input())
print(a[c % n - 1] + b[c % m - 1])
s -= 1
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<string> s(n), t(m);
for (int i = 0; i < n; i++)
{
cin >> s[i];
}
for (int i = 0; i < m; i++)
{
cin >> t[i];
}
int q;
cin >> q;
for (; q > 0; q--)
{
int y;
cin >> y;
cout << s[(y + n - 1) % n] << t[(y + m - 1) % m] << endl;
}
return 0;
}
227B - Effective Approach | 1534B - Histogram Ugliness |
1611B - Team Composition Programmers and Mathematicians | 110A - Nearly Lucky Number |
1220B - Multiplication Table | 1644A - Doors and Keys |
1644B - Anti-Fibonacci Permutation | 1610A - Anti Light's Cell Guessing |
349B - Color the Fence | 144A - Arrival of the General |
1106A - Lunar New Year and Cross Counting | 58A - Chat room |
230A - Dragons | 200B - Drinks |
13A - Numbers | 129A - Cookies |
1367B - Even Array | 136A - Presents |
1450A - Avoid Trygub | 327A - Flipping Game |
411A - Password Check | 1520C - Not Adjacent Matrix |
1538B - Friends and Candies | 580A - Kefa and First Steps |
1038B - Non-Coprime Partition | 43A - Football |
50A - Domino piling | 479A - Expression |
1480A - Yet Another String Game | 1216C - White Sheet |